Probabilistic programming semantics for name generation

نویسندگان

چکیده

We make a formal analogy between random sampling and fresh name generation. show that quasi-Borel spaces, model for probabilistic programming, can soundly interpret the ν-calculus, calculus Moreover, we prove this semantics is fully abstract up to first-order types. This surprising an ‘off-the-shelf’ model, requires novel analysis of probability distributions on function spaces. Our tools are diverse include descriptive set theory normal forms ν-calculus.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Commutative Semantics for Probabilistic Programming

We show that a measure-based denotational semantics for probabilistic programming is commutative. The idea underlying probabilistic programming languages (Anglican, Church, Hakaru, ...) is that programs express statistical models as a combination of prior distributions and likelihood of observations. The product of prior and likelihood is an unnormalized posterior distribution, and the inferenc...

متن کامل

Probabilistic Logic Programming Under the Distribution Semantics

The combination of logic programming and probability has proven useful for modeling domains with complex and uncertain relationships among elements. Many probabilistic logic programming (PLP) semantics have been proposed, among these the distribution semantics has recently gained an increased attention and is adopted by many languages such as the Independent Choice Logic, PRISM, Logic Programs ...

متن کامل

A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming

The aim of this work is to provide a probabilistic foundation for nondeterministic computations in Concurrent Constraint Programming (CCP). Diierently from common approaches in (imperative) high-level programming languages, which rely on some kind of random() function, we introduce randomness in the very deenition of the language by means of a probabilistic choice construct. This allows a progr...

متن کامل

S-finite Kernels and Game Semantics for Probabilistic Programming

ion We can define a (call-by-name) small-step operational semantics for PIA as a finite kernel if we equip the syntax with a measurable space structure as described in, for instance, [8]. We can note that this induces a big-step semantics which is an s-finite kernel, as a supremum of anω-chain of finite kernels. We note that our denotational semantics is adequate with respect to this operationa...

متن کامل

An Operational Semantics for Probabilistic Concurrent Constraint Programming

This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called \randomised algorithms" within the CCP framework. Diierently from common approaches in (imperative) high-level programming languages, which rely on some kind of random() function, we introduce randomness in the very deenition of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2021

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3434292